import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: AliceMana
 * Date: 2022-11-27
 * Time: 16:58
 */
public class Main {
    public static int StrToInt(String str) {
        if (str.length() == 0) {
            return 0;
        }
        for (int i = 0; i < str.length(); i++) {
            if ((str.charAt(i) < 48 || str.charAt(i) > 57)) {
                if (str.charAt(i) != '-' && str.charAt(i) != '+') {
                    return 0;
                }
            }
        }
        int ret = 0;
        for (int i = str.length()-1; i > 0; i--) {
            ret += (str.charAt(i)-48) * Math.pow(10, str.length()-1-i);
        }
        if (str.charAt(0) == '-') {
            ret = -ret;
        } else if (str.charAt(0)!= '+') {
            ret += (str.charAt(0)-48) * Math.pow(10, str.length()-1);
        }
        return ret;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.nextLine();
        System.out.println(StrToInt(str));
    }
    // 不要二
    // 欧里几何距离, 因为都为整数, 所以结果为4(算术平方根为2)的结果只能是
    // 0+4 或 4+0  只要让x1-x2=2或y1-y2=2的格子不算就行
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int w = in.nextInt();
        int h = in.nextInt();
        int[][] arr = new int[w][h];
        int ret = 0;

        for (int i = 0; i < w; i++) {
            for (int j = 0; j < h; j++) {
                if (arr[i][j] == 0) {
                    ret++;
                    // 判断数组是否会越界
                    if (i + 2 < w) {
                        arr[i+2][j] = 1;
                    }
                    if (j + 2 < h) {
                        arr[i][j+2] = 1;
                    }
                }
            }
        }
        System.out.println(ret);
    }
}
